Non-Mechanism in Quantum Oracle Computing
نویسنده
چکیده
A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As well known, some oracle problems are solved more efficiently by using quantum algorithms; this naturally implies changing the computer to quantum, while the choice of the software program remains sharp. In order to highlight the non-mechanistic origin of this higher efficiency, also the uncertainty about which program is installed must be represented in a quantum way.
منابع مشابه
Quantum subroutine problem and the robustness of quantum complexity classes
This paper positively solves the quantum subroutine problem for fully quantum oracles. The quantum subroutine problem asks whether a quantum computer with an efficiently computable oracle can be efficiently simulated by a non-oracle quantum computer. We extends the earlier results obtained by Bennett, Bernstein, Brassard, and Vazirani, and by Aharonov, Kitaev, and Nisan to the case where the or...
متن کاملTightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model
We give a rst tight security reduction for a conversion from a weaklysecure public-key encryption scheme to an IND-CCA-secure key-encapsulation mechanism scheme in the quantum random oracle model. To the best of our knowledge, previous reductions are non-tight as the security levels of the obtained schemes are degraded to at most half or quater of the original security level (Boneh, Dagdelen, F...
متن کاملComputational Power of Quantum vs Classical Oracles
Comparing the computational power of quantum computers vs classical computers has been extensively studied since the invention of quantum computing. A related question is whether a quantum oracle is more powerful than a classical oracle. In this paper, we examine two topics that give partial answers to this question. We show that we can imitate a polynomial number of columns of a quantum oracle...
متن کاملA New Model Representation for Road Mapping in Emerging Sciences: A Case Study on Roadmap of Quantum Computing
One of the solutions for organizations to succeed in highly competitive markets is to move toward emerging sciences. These areas provide many opportunities, but, if organizations do not meet requirements of emerging sciences, they may fail and eventually, may enter a crisis. In this matter, one of the important requirements is to develop suitable roadmaps in variety fields such as strategic, ca...
متن کاملSuccinct quantum proofs for properties of finite groups
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-type proof. Specifically, we consider quantum proofs for properties of black-box groups, which are finite groups whose elements are encoded as strings of a given length and whose group operations are perf...
متن کامل